Fast Search

Results: 263



#Item
241Differential binary trees A fast and compact data structure By Adriaan van Os <adriaan@microbizz.nl> Differential binary trees store data embedded in the flow of the tree. This

Differential binary trees A fast and compact data structure By Adriaan van Os Differential binary trees store data embedded in the flow of the tree. This

Add to Reading List

Source URL: www.microbizz.nl

Language: English - Date: 2013-01-18 08:38:46
242mxTextTools  Fast Text Parsing and Processing for Python

mxTextTools Fast Text Parsing and Processing for Python

Add to Reading List

Source URL: www.egenix.com

Language: English - Date: 2013-12-10 04:17:02
243Learning for Web Rankings  David Grangier AT&T Labs Research [removed]

Learning for Web Rankings David Grangier AT&T Labs Research [removed]

Add to Reading List

Source URL: david.grangier.info

Language: English - Date: 2011-10-03 18:18:20
244Fast and Eective Query Renement Bienvenido Velez1 , Ron Weiss1 , Mark A. Sheldon2 , David K. Giord1 1 2

Fast and E ective Query Re nement Bienvenido Velez1 , Ron Weiss1 , Mark A. Sheldon2 , David K. Gi ord1 1 2

Add to Reading List

Source URL: www.psrg.lcs.mit.edu

Language: English - Date: 2013-07-14 14:56:24
245Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs Fabian Kuhn1 , Thomas Moscibroda1 , Tim Nieberg2? , and Roger Wattenhofer1 1

Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs Fabian Kuhn1 , Thomas Moscibroda1 , Tim Nieberg2? , and Roger Wattenhofer1 1

Add to Reading List

Source URL: distcomp.ethz.ch

Language: English - Date: 2005-07-24 07:43:23
246Automatic online tuning for fast Gaussian summation  Vlad I. Morariu1∗, Balaji V. Srinivasan1 , Vikas C. Raykar2 , Ramani Duraiswami1 , and Larry S. Davis1 1 University of Maryland, College Park, MD[removed]

Automatic online tuning for fast Gaussian summation Vlad I. Morariu1∗, Balaji V. Srinivasan1 , Vikas C. Raykar2 , Ramani Duraiswami1 , and Larry S. Davis1 1 University of Maryland, College Park, MD[removed]

Add to Reading List

Source URL: www.umiacs.umd.edu

Language: English - Date: 2009-01-10 03:54:48
247Fast Algorithms for Sorting and Searching Strings Jon L. Bentley* Abstract We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C

Fast Algorithms for Sorting and Searching Strings Jon L. Bentley* Abstract We present theoretical algorithms for sorting and searching multikey data, and derive from them practical C

Add to Reading List

Source URL: www.cs.princeton.edu

Language: English - Date: 1996-10-24 21:25:42
248Harten Recruitment  Providing fast-track solutions to your recruitment requirements Harten Group has in-depth knowledge of the pharmaceutical and biotech industries and an extensive network of over 2000 senior consultant

Harten Recruitment Providing fast-track solutions to your recruitment requirements Harten Group has in-depth knowledge of the pharmaceutical and biotech industries and an extensive network of over 2000 senior consultant

Add to Reading List

Source URL: www.hartengroup.co.uk

Language: English - Date: 2009-06-04 15:22:39
249Linear-time Algorithms for Pairwise Statistical Problems Parikshit Ram

Linear-time Algorithms for Pairwise Statistical Problems Parikshit Ram

Add to Reading List

Source URL: www.fast-lab.org

Language: English - Date: 2009-09-12 18:13:20
250Fast Approximate String Matching in a Dictionary Ricardo Baeza-Yates Gonzalo Navarro Dept. of Computer Science, University of Chile

Fast Approximate String Matching in a Dictionary Ricardo Baeza-Yates Gonzalo Navarro Dept. of Computer Science, University of Chile

Add to Reading List

Source URL: www.dcc.uchile.cl

Language: English - Date: 2008-08-14 13:19:32